Implementation Issues of the Autotuning Fair Share Algorithm
نویسنده
چکیده
There are two main components in the sender-side implementation of TCP Autotuning socket buffers [SMM98]. The first component determines what socket buffer size a connection desires based on its congestion window, which reflects this connection's round trip time and its share of the available bandwidth. The second component is the algorithm that is used to determine a connection's fair share of the memory resources, since not all connections may be able to obtain the buffer sizes they desire. This document describes problems experienced in implementing the second component, the max-min fair share algorithm.
منابع مشابه
Fair Scheduling in Broadcast Environments
This report considers the problems of scheduling transmissions in broadcast environments, including, wireless environments. Issues that affect the design of fair scheduling algorithms, and several alternative approaches to implementing fair scheduling in single-hop and multi-hop environments are identified.
متن کاملA Comparative Study of the Principles of Fair Proceeding in Iran with Tax Litigation patterns in the United States, Britain, France and Germany
One of the most important economic topics in every country is considering tax issues as a way of increasing the government's income through attracting public confidence by observing the principles of proceeding in the tax system of the country which might likely cause a national production boom, increase economic growth rate, reduce unemployment and the fair distribution of wealth. In this rega...
متن کاملA Dynamic Load Balancing Algorithm in Computational Grid Using Fair Scheduling
Grid Computing has emerged as an important new field focusing on resource sharing. One of the most challenging issues in Grid Computing is efficient scheduling of tasks. In this paper, we propose a Load balancing algorithm for fair scheduling, and we compare it to other scheduling schemes such as the Earliest Deadline First, Simple Fair Task order, Adjusted Fair Task Order and Max Min Fair Sche...
متن کاملStock price prediction using the Chaid rule-based algorithm and particle swarm optimization (pso)
Stock prices in each industry are one of the major issues in the stock market. Given the increasing number of shareholders in the stock market and their attention to the price of different stocks in transactions, the prediction of the stock price trend has become significant. Many people use the share price movement process when com-paring different stocks while investing, and also want to pred...
متن کاملA Dynamic Error Based Fair Scheduling Algorithm for a Computational Grid
Grid Computing has emerged as an important new field focusing on resource sharing. One of the most challenging issues in Grid Computing is efficient scheduling of tasks. In this paper, we propose a new algorithm for fair scheduling, and we compare it to other scheduling schemes such as the First Come First Served and the Round Robin schemes for a computational grid. It aims at addressing the fa...
متن کامل